Reconfigurable Mesh Algorithms For The Area And Perimeter Of Image Components And Histogramming*
نویسندگان
چکیده
We consider the following image processing problems: compute the area and perimeter of the components of an image, compute the histogram of an image, and histogram modification. Parallel reconfigurable mesh computer algorithms are developed for these problems. The area and perimeter of the components of an N×N image are computed in O (logN) time by an N×N RMESH; the histogram of an N×N image is computed by an N×N RMESH in O (min {√ B log(N/√ B ), N}) time where B is the number of gray scale values; and histogram modification is done in O (√ N ) time by an N×N RMESH.
منابع مشابه
Histogramming on a Reconfigurable Mesh Computer
We develop reconfigurable mesh (RMESH) algorithms for window broadcasting, data shifts, and consecutive sum. These are then used to develop efficient algorithms to compute the histogram of an image and to perform histogram modification. The histogram of an N×N image is computed by an N×N RMESH in O (√ B log√ B (N/√ B ) for B < N, Ο(√ N ) for B = N, and Ο(√ B ) for B > N. B is the number of gray...
متن کاملEnhanced Mesh-Connected Computers for Image Processing Applications - Computer Architectures for Machine Perception, 1995. Proceedings. CAMP '95
The Reconfigurable Array with Spanning Optical Buses ( R A S O B ) has recently been introduced as an efficient enhanced mesh-connected parallel computer. RASOB combines some of the advantage characteristics of reconfigurable meshes and meshes with optical pipelined buses. In this paper, we use this computing model for the efficient design of fundamental image processing applications. In order ...
متن کاملConstant-Time Convexity Problems on Reconfigurable Meshes
The purpose of this paper is to demonstrate that the versatility of the reconngurable mesh can be exploited to devise constant-time algorithms for a number of important computational tasks relevant to robotics, computer graphics, image processing, and computer vision. In all our algorithms, we assume that one or two n-vertex (convex) polygons are pretiled, one vertex per processor, onto a recon...
متن کاملGeometric Data Structures on a Reconfigurable Mesh, with Applications
We present several geometric data structures and algorithms for problems for a planar set of rectangles and bipartitioning problems for a point set in two dimensions on a reconfigurable mesh of size n n. The problems for rectangles include computing the measure, contour, perimeter and maximum clique for the union of a set of rectangles. The bipartitioning problems for a two dimensional point se...
متن کامل